Weighing Hypotheses: Incremental Learning from Noisy Data

نویسنده

  • Philip Laird
چکیده

Incremental learning from noisy data presents dual challenges: that of evaluating multiple hypotheses incrementally and that of distinguishing errors due to noise from errors due to faulty hypotheses. This problem is critical in such areas of machine learning as concept learning, inductive programming, and sequence prediction. I develop a general, quantitative method for weighing the merits of different hypotheses in light of their performance on possibly noisy data. The method is incremental, independent of the hypothesis space, and grounded in Bayesian probability.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the power of incremental

This paper provides a systematic study of incremental learning from noise-free and from noisy data. As usual, we distinguish between learning from positive data and learning from positive and negative data, synonymously called learning from text and learning from informant. Our study relies on the notion of noisy data introduced by Stephan. The basic scenario, named iterative learning, is as fo...

متن کامل

On the effect of low-quality node observation on learning over incremental adaptive networks

In this paper, we study the impact of low-quality node on the performance of incremental least mean square (ILMS) adaptive networks. Adaptive networks involve many nodes with adaptation and learning capabilities. Low-quality mode in the performance of a node in a practical sensor network is modeled by the observation of pure noise (its observation noise) that leads to an unreliable measurement....

متن کامل

On the strength of incremental learningSte

This paper provides a systematic study of incremental learning from noise-free and from noisy data, thereby distinguishing between learning from only positive data and from both positive and negative data. Our study relies on the notion of noisy data introduced in 22]. The basic scenario, named iterative learning, is as follows. In every learning stage, an algorithmic learner takes as input one...

متن کامل

Stream-Based Learning through Data Selection in a Road Safety Application⋆

In this paper, we derive incremental learning algorithms from a difficult real world task. Our application learns how to evaluate the risk of collision for road users at intersections, based on occupation measurements supplied by video sensors. The data are noisy and complex, and only a human expert can evaluate the risk on video recordings. In order to avoid arbitrary labeling, the expert is a...

متن کامل

Distributed Incremental Least Mean-Square for Parameter Estimation using Heterogeneous Adaptive Networks in Unreliable Measurements

Adaptive networks include a set of nodes with adaptation and learning abilities for modeling various types of self-organized and complex activities encountered in the real world. This paper presents the effect of heterogeneously distributed incremental LMS algorithm with ideal links on the quality of unknown parameter estimation. In heterogeneous adaptive networks, a fraction of the nodes, defi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1993